North-holland Virtual Lines, a Deadlock-free and Real-time Routing Mechanism for Atm Networks
نویسندگان
چکیده
In this paper, we present a routing mechanism and buffer allocation mechanism for an ATM switching fabric. Since the fabric will be used to transfer multimedia traffic, it should provide a guaranteed throughput and a bounded latency. We focus on the design of a suitable routing mechanism that is capable of fulfilling these requirements and is free of deadlocks. We will describe two basic concepts that can bc used to implement deadlock-free routing. Routing of messages is closely related to buffering. W'e have organized the buffers into parallel FIFO's, cach representing a virtual line. In this way, we not only have solved the problem of head of line blocking, but wc can also give real-time guarantees. Wc will show that for local high-speed networks, it is more advantageous to havc a proper flow control than to have large buffers. Although the virtual line concept can have a low buffer utilization, the transfcr efficiency can be higher. The virtual line concept allows adaptive routing. The total throughput of the network can be improved by using alternative routes. Adaptive routing is attractive in networks where alternative routes are not much longer than the initial route(s). The network of the switching fabric is built up from switching elements interconnected in a Kautz topology.
منابع مشابه
Virtual Lines, a Deadlock-Free and Real-Time Routing Mechanism for ATM Networks
In this paper2 we present a routing mechanism and buffer allocation mechanism for an ATM switching fabric. Since the fabric will be used to transfer multimedia traffic it should provide a guaranteed throughput and a bounded latency. We focus on the design of a suitable routing mechanism that is capable to fulfil these requirements and is free of deadlocks. We will describe two basic concepts th...
متن کاملDescending Layers Routing: A Deadlock-Free Deterministic Routing using Virtual Channels in System Area Networks with Irregular Topologies
System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Since wormhole or virtual cut-through transfer is used for low latency communication, deadlock-free routings are essential in SANs. In this paper, we propose a novel deadlock-free deterministic routing called descending layers (DL) routin...
متن کاملHierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing
Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...
متن کاملGeneralized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent
This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-recovery which relaxes the sequential recovery requirement for simultaneous recovery from deadlocks. The proposed extension to Disha does not necessitate any additional res...
متن کاملAn Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کامل